Numerical equilibrium analysis for structured consumer resource models

In this paper, we present methods for a numerical equilibrium and stability analysis for models of a size structured population competing for an unstructured resource. We concentrate on cases where two model parameters are free, and thus existence boundaries for equilibria and stability boundaries can be defined in the (two-parameter) plane. We numerically trace these implicitly defined curves using alternatingly tangent prediction and Newton correction. Evaluation of the maps defining the curves involves integration over individual size and individual survival probability (and their derivatives) as functions of individual age. Such ingredients are often defined as solutions of ODE, i.e., in general only implicitly. In our case, the right-hand sides of these ODE feature discontinuities that are caused by an abrupt change of behavior at the size where juveniles are assumed to turn adult. So, we combine the numerical solution of these ODE with curve tracing methods. We have implemented the algorithms for “Daphnia consuming algae” models in C-code. The results obtained by way of this implementation are shown in the form of graphs

Exploration of cellular reaction systems

We discuss and review different ways to map cellular components and their temporal interaction with other such components to different non-spatially explicit mathematical models. The essential choices made in the literature are between discrete and continuous state spaces, between rule and event-based state updates and between deterministic and stochastic series of such updates. The temporal modelling of cellular regulatory networks (dynamic network theory) is compared with static network approaches in two first introductory sections on general network modelling. We concentrate next on deterministic rate-based dynamic regulatory networks and their derivation. In the derivation, we include methods from multiscale analysis and also look at structured large particles, here called macromolecular machines. It is clear that mass-action systems and their derivatives, i.e. networks based on enzyme kinetics, play the most dominant role in the literature. The tools to analyse cellular reaction networks are without doubt most complete for mass-action systems. We devote a long section at the end of the review to make a comprehensive review of related tools and mathematical methods. The emphasis is to show how cellular reaction networks can be analysed with the help of different associated graphs and the dissection into modules, i.e. sub-networks

Graph theory and qualitative analysis of reaction networks

Different types of macroscopic reaction kinetics can be derived from microscopic molecular interactions, with the law of mass action being the most widely used one in standard situations. After such a modeling step, where primarily the types of reactions are identified, it becomes a problem to analyse qualitative properties of complete regulatory networks. This problem has to be tackled, because chemical reaction networks play a part in some of the most fundamental cellular processes such as cell metabolism and regulation of cell signalling processes. This paper discusses how reaction networks can be described and analysed by graph theoretic means. Graph theory is a useful analysis tool for complex reaction networks, in situations where there is parameter uncertainty or modeling information is incomplete. Graphs are very robust tools, in the sense that whole classes of network topologies will show similar behaviour, independently of precise information that is available about the reaction constants. Nevertheless, one still has to take care to incorporate sufficient dynamical information in the network structure, in order to obtain meaningful results

Introduction to special issue ECCS’09 in Theory in Biosciences

The papers collected in this special issue of Theory in Biosciences represent a part of the research presented during European Conference on Complex Systems 2009 (ECCS’09), located at the University of Warwick, United Kingdom

Bistability and oscillations in chemical reaction networks

Bifurcation theory is one of the most widely used approaches for analysis of dynamical behaviour of chemical and biochemical reaction networks. Some of the interesting qualitative behaviour that are analyzed are oscillations and bistability (a situation where a system has at least two coexisting stable equilibria). Both phenomena have been identified as central features of many biological and biochemical systems. This paper, using the theory of stoichiometric network analysis (SNA) and notions from algebraic geometry, presents sufficient conditions for a reaction network to display bifurcations associated with these phenomena. The advantage of these conditions is that they impose fewer algebraic conditions on model parameters than conditions associated with standard bifurcation theorems. To derive the new conditions, a coordinate transformation will be made that will guarantee the existence of branches of positive equilibria in the system. This is particularly useful in mathematical biology, where only positive variable values are considered to be meaningful. The first part of the paper will be an extended introduction to SNA and algebraic geometry-related methods which are used in the coordinate transformation and set up of the theorems. In the second part of the paper we will focus on the derivation of bifurcation conditions using SNA and algebraic geometry. Conditions will be derived for three bifurcations: the saddle-node bifurcation, a simple branching point, both linked to bistability, and a simple Hopf bifurcation. The latter is linked to oscillatory behaviour. The conditions derived are sufficient and they extend earlier results from stoichiometric network analysis as can be found in (Aguda and Clarke in J Chem Phys 87:3461-3470, 1987; Clarke and Jiang in J Chem Phys 99:4464-4476, 1993; Gatermann et al. in J Symb Comput 40:1361-1382, 2005). In these papers some necessary conditions for two of these bifurcations were given. A set of examples will illustrate that algebraic conditions arising from given sufficient bifurcation conditions are not more difficult to interpret nor harder to calculate than those arising from necessary bifurcation conditions. Hence an increasing amount of information is gained at no extra computational cost. The theory can also be used in a second step for a systematic bifurcation analysis of larger reaction networks